Discrete-continuous project scheduling with preemptable activities

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Project Scheduling with Simultaneous Optimization, Time, Net Present Value, and Project Flexibility for Multimode Activities with Constrained Renewable Resources

Project success is assessed based on various criteria, every one of which enjoys a different level of importance for the beneficiaries and decision makers. Time and cost are the most important objectives and criteria for the project success. On the other hand, reducing the risk of finishing activities until the predetermined deadlines should be taken into account. Having formulated the problem ...

متن کامل

Scheduling preemptable tasks on parallel processors with limited availability

It is well known that in the majority of cases the problem of preemptive task scheduling on m parallel identical processors with the objective of minimizing makespan can be solved in polynomial time. For example, for tree-like precedence constraints the algorithm of Muntz and Co€man can be applied. In this paper, this problem is generalized to cover the case of parallel processors which are ava...

متن کامل

Project Scheduling with Discrete Time-resource and Resource-resource Tradeoos

We consider an extension of the classical resource-constrained project scheduling problem (RCPSP), which covers discrete resource-resource and time-resource tradeo s. As a result a project scheduler is permitted to identify several alternatives or modes of accomplishment for each activity of the project. The solution procedure we present is a considerable generalization of the branch-and-bound ...

متن کامل

New continuous-time and discrete-time mathematical formulations for resource-constrained project scheduling problems

Two binary integer programming discrete-time models and two precedence-based mixed integer programming continuous-time formulations are developed for the resource-constrained project scheduling problem. The discrete-time models are based on the definition of binary variables that describe the processing state of every activity between two consecutive time points, while the continuous-time model...

متن کامل

Online optimization for scheduling preemptable tasks on IaaS cloud systems

In Infrastructure-as-a-Service (IaaS) cloud computing, computational resources are provided to remote users in the form of leases. For a cloud user, he/she can request multiple cloud services simultaneously. In this case, parallel processing in the cloud system can improve the performance. When applying parallel processing in cloud computing, it is necessary to implement a mechanism to allocate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Polish Academy of Sciences Technical Sciences

سال: 2016

ISSN: 2300-1917

DOI: 10.1515/bpasts-2016-0043